Dynamic Boolean Matrix Factorizations Pauli Miettinen Max Planck Institute for Informatics Saarbr¨ucken, Germany

Source URL: people.mpi-inf.mpg.de

The Difference and the Norm Characterising Similarities and Differences between Databases Kailash Budhathoki and Jilles Vreeken Max-Planck Institute for Informatics and Saarland University, Germany {kbudhath,jilles}@mpi-

Source URL: eda.mmci.uni-saarland.de

Non-Parametric Jensen-Shannon Divergence Hoang-Vu Nguyen and Jilles Vreeken Max-Planck Institute for Informatics and Saarland University, Germany {hnguyen,jilles}@mpi-inf.mpg.de Abstract. Quantifying the difference betw

Source URL: eda.mmci.uni-saarland.de

• Statistics
• Probability
• Mathematical analysis
• Information theory
• Statistical theory
• Statistical distance
• Probability distributions
• Stable distributions
• KullbackLeibler divergence
• Normal distribution
• Divergence
• Entropy

Keyword Search over RDF Graphs Shady Elbassuoni ∗† Roi Blanco Max-Planck Institute for Informatics

Source URL: livingknowledge.europarchive.org

• Computing
• Information science
• Data management
• Semantic Web
• Resource Description Framework
• Web services
• Knowledge representation
• SPARQL
• XML retrieval
• Semantic triple
• Information retrieval
• Semantic search

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d

Source URL: people.mpi-inf.mpg.de

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Combinatorial optimization
• NP-hard problems
• Approximation algorithms
• Edsger W. Dijkstra
• Travelling salesman problem
• Nearest neighbour algorithm
• Shortest path problem
• Maximal independent set

A MDL4BMF: Minimum Description Length for Boolean Matrix Factorization PAULI MIETTINEN, Max-Planck Institute for Informatics JILLES VREEKEN, Max-Planck Institute for Informatics, Saarland University, University of Antwer

Source URL: people.mpi-inf.mpg.de

• Algebra
• Mathematics
• Linear algebra
• Matrix theory
• Numerical linear algebra
• Multivariate statistics
• Dimension reduction
• Non-negative matrix factorization
• Matrix
• Singular value decomposition
• Principal component analysis
• Factorization

Can Quantum Search Accelerate Evolutionary Algorithms? Daniel Johannsen Max Planck Institute for Informatics Department of Algorithms and Complexity Saarbrücken, Germany

Source URL: www.cse.iitk.ac.in

• Theoretical computer science
• Theory of computation
• Computational complexity theory
• Quantum algorithms
• Quantum computing
• Models of computation
• Decision tree model
• Quantum phase estimation algorithm
• PP
• Quantum walk
• Time complexity
• Quantum information

Active Knowledge: Dynamically Enriching RDF Knowledge Bases by Web Services Nicoleta Preda Max Planck Institute for Informatics Saarbrücken, Germany

Source URL: event.cwi.nl

• Computing
• Data management
• Data
• Resource Description Framework
• Query languages
• Web services
• Semantic Web
• Datalog
• SPARQL
• Prolog
• Data integration
• Query optimization

Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator? Karl Bringmann1 , Tobias Friedrich2 , and Patrick Klitzke3 1 Max Planck Institute for Informatics, Saarbr¨

Source URL: people.mpi-inf.mpg.de

• Mathematical optimization
• Cybernetics
• Evolution
• Operations research
• Genetic algorithms
• Multi-objective optimization
• Evolutionary algorithm
• Pareto efficiency
• Evolutionary computation
• Reduction
• Fitness function

An Efficient and Versatile Query Engine for TopX Search Martin Theobald, Ralf Schenkel, Gerhard Weikum Max-Planck Institute for Informatics Stuhlsatzenhausweg 85, DSaarbruecken, Germany {mtb, schenkel, weikum}@mpi

Source URL: www.vldb2005.org

• XPath
• Search engine indexing
• Bin
• Heap
• PageRank
• XML retrieval
• Search engine technology
• HTML element